package codeRandomThoughts.Test617合并二叉树;

import codeRandomThoughts.utils.TreeNode;

public class Solution2 {
    //递归
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        if (root1 == null) {
            return root2;
        }
        if (root2 == null) {
            return root1;
        }

        //剩下的就是roo1和root2都不为空
        TreeNode root = new TreeNode();
        root.val = root1.val + root2.val;
        root.left = mergeTrees(root1.left, root2.left);
        root.right = mergeTrees(root1.right, root2.right);
        return root;
    }
}

